package Interview;

import java.util.Scanner;

/**
 * Created by loso on 2017/3/25.
 */
public class _neteasy_2017325Test {

        public static void main(String[] args) {
            Scanner in = new Scanner(System.in);
            while (in.hasNextInt()) {//注意while处理多个case
                int numtaxi = in.nextInt();
                int[] tx = new int[numtaxi];
                int[] ty = new int[numtaxi];
                for (int i = 0; i < numtaxi; i++) {
                    tx[i] = in.nextInt();
                }
                for (int i = 0; i < numtaxi; i++) {
                    ty[i] = in.nextInt();
                }
                int gx = in.nextInt();
                int gy = in.nextInt();
                int wT = in.nextInt();
                int tT = in.nextInt();
                int min = wT * (Math.abs(gx)+Math.abs(gy));
                for (int i = 0; i < numtaxi; i++) {
                    int gbt = (Math.abs(tx[i]) + Math.abs(ty[i]))* wT + (Math.abs(gx-tx[i])+Math.abs(gy-ty[i]))*tT;
                    min = min<gbt?min:gbt;
                }
                System.out.println(min);
            }
        }
}

